Edge Odd Gracefulness of 2-NC4, 3-NC4, 4-NC4

ثبت نشده
چکیده

A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, ..., (2k-1)}defined by f+(x)  f(x, y) (mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes all the edges distinct Reference A.Solairaju and K.Chitra Edge-odd graceful labeling of some graphs “ Electronics Notes in Discrete Mathematics Volume 33,April 2009, Pages 15 – 20 A.Solairaju, A.Sasikala, C.Vimala Edge-odd Gracefulness of a spanning tree of Cartesian product of P2 and Cn ,Pacific-Asian Journal of Mathematics, Vol .3, No.1-2. (Jan-Dec.2009)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge Odd Gracefulness of 2-NC4, 3-NC4, 4-NC4

A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, ..., (2k-1)}defined by f+(x)  f(x, y) (mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes all the edges distinct Reference A.Solairaju and K.Chitra Edge-odd graceful labeling of some graphs “ Electronics N...

متن کامل

Edge Odd Gracefulness of 2-NC4, 3-NC4, 4-NC4

A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, ..., (2k-1)}defined by f+(x)  f(x, y) (mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes all the edges distinct Reference A.Solairaju and K.Chitra Edge-odd graceful labeling of some graphs “ Electronics N...

متن کامل

Edge Odd Gracefulness of 2-NC4, 3-NC4, 4-NC4

A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, ..., (2k-1)}defined by f+(x)  f(x, y) (mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes all the edges distinct Reference A.Solairaju and K.Chitra Edge-odd graceful labeling of some graphs “ Electronics N...

متن کامل

Edge Odd Gracefulness of 2-NC4, 3-NC4, 4-NC4

A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, ..., (2k-1)}defined by f+(x)  f(x, y) (mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes all the edges distinct Reference A.Solairaju and K.Chitra Edge-odd graceful labeling of some graphs “ Electronics N...

متن کامل

Edge Odd Gracefulness of 2-NC4, 3-NC4, 4-NC4

A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, ..., (2k-1)}defined by f+(x)  f(x, y) (mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes all the edges distinct Reference A.Solairaju and K.Chitra Edge-odd graceful labeling of some graphs “ Electronics N...

متن کامل

Edge Odd Gracefulness of 2-NC4, 3-NC4, 4-NC4

A (p, q) connected graph is edge-odd graceful graph if there exists an injective map f: E(G) → {1, 3, ..., 2q-1} so that induced map f+: V(G) → {0, 1,2, 3, ..., (2k-1)}defined by f+(x)  f(x, y) (mod 2k), where the vertex x is incident with other vertex y and k = max {p, q} makes all the edges distinct.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017